Tchebyshev triangulations of stable simplicial complexes
نویسندگان
چکیده
منابع مشابه
Tchebyshev triangulations of stable simplicial complexes
We generalize the notion of the Tchebyshev transform of a graded poset to a triangulation of an arbitrary simplicial complex in such a way that, at the level of the associated F -polynomials ∑ j fj−1((x − 1)/2), the triangulation induces taking the Tchebyshev transform of the first kind. We also present a related multiset of simplicial complexes whose association induces taking the Tchebyshev t...
متن کاملTriangulations of Simplicial Polytopes
Various facts about triangulations of simplicial polytopes, particularly those pertaining to the equality case in the generalized lower bound conjecture, are collected together here. They include an apparently weaker restriction on the kind of triangulation which needs to be found, and an inductive argument which reduces the number of cases to be established.
متن کاملClassification of Simplicial Triangulations of Topological Manifolds
In this note we announce theorems which classify simplicial (not necessarily combinatorial) triangulations of a given topological «-manifold M, n > 7 (> 6 if dM = 0 ) , in terms of homotopy classes of lifts of the classifying map r: M —• BTOP for the stable topological tangent bundle of M to a classifying space BTRIn which we introduce below. The (homotopic) fiber of the natural map ƒ: BTRIn —•...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملMinimal Simplicial Dissections and Triangulations of Convex
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P . • Can the minimal number of tetrahedra in a triangulation be decreased if one allows the use of interior points of P as vertices? • Can a dissection of P use fewer tetrahedra than a triangulation? • Does the size of a minimal triangulation depend on the concrete realization of P ? The m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2008
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2007.07.007